The generator matrix

 1  0  0  0  1  1  1  0  1  1  1  1  0  0  0  X  1  1  1  1  1  0  1  0  1  1  0  0  X  X  X  X  X  0  1  1  1  1  1  1  1  1  1  1  1  1  X  1  1  1  1  0  X  X  X  X  0  X  X  0  X  X  0  X  X  X  X  X  1  1  1  1  X  X  0
 0  1  0  0  X  1 X+1  1  0  1  X X+1  1  X  1  1  0  1  0  1  X  1 X+1  0  X X+1  1  0  1  0  X  1  1  1  0  1  X X+1  0  1  X X+1  X X+1  0  1  1  X  0  X  0  1  1  1  1  1  X  X  0  1  1  0  1  1  X  1  1  0 X+1  1  1 X+1  1  X  0
 0  0  1  0  0  0  0  X  1  1  1  1 X+1  1  1  0  X  X X+1 X+1  X X+1  X  1 X+1 X+1  X  X  1  1  1 X+1  X  0  0  0  X  X  X  X  0  0  0  1  X X+1 X+1  1 X+1 X+1  1  1  X  X  0  0  1  0  0 X+1 X+1  X X+1 X+1  X  1  1  X  0  0 X+1 X+1 X+1  1  1
 0  0  0  1  1 X+1  X X+1 X+1  0  X  1  X  1 X+1  1  X  1  1  X X+1  1  0  X  0 X+1  X  1  0 X+1  1  X X+1  1  X  1  X  1  0 X+1  0 X+1 X+1 X+1 X+1 X+1  0  0  0  X  X  0  0  X  X  0  1  1  1  X  1  1  0 X+1  1 X+1  1  0  0  X  1  1  X  0  0

generates a code of length 75 over Z2[X]/(X^2) who´s minimum homogenous weight is 72.

Homogenous weight enumerator: w(x)=1x^0+102x^72+48x^74+54x^76+16x^78+16x^80+8x^84+6x^88+2x^92+3x^96

The gray image is a linear code over GF(2) with n=150, k=8 and d=72.
As d=72 is an upper bound for linear (150,8,2)-codes, this code is optimal over Z2[X]/(X^2) for dimension 8.
This code was found by Heurico 1.16 in 0.0963 seconds.